Metalevel argumentation

Metalevel argumentation

The abstract nature of Dung’s seminal theory of argumentation accounts for its widespread application as a general framework for various species of nonmonotonic reasoning, and, more generally, reasoning in the presence of conflict, whether such conflict arises given uncertain or incomplete information or as a result of differing opinions or preferences. In this paper we formalise reasoning abou...

Firewall configuration: An application of multiagent metalevel argumentation

Firewalls are an important tool in the provision of network security. Packet filtering firewalls are configured by providing a set of rules that identify how to handle individual data packets that arrive at the firewall. In large firewall configurations, conflicts may arise between these rules. Argumentation provides a way of handling such conflicts that illuminates their origin, and hence can ...

Principles of Metalevel Control

Principles of Metalevel Control by Nicholas James Hay Doctor of Philosophy in Computer Science University of California, Berkeley Professor Stuart Russell, Chair Intelligent agents perform computations to help them decide how to act. But which computations will best inform these decisions? How long should an agent think before acting? Given the impracticality of performing all possible relevant...

Metalevel computation in Maude

Metalevel algorithms for variant satisfiability

Variant satisfiability is a theory-generic algorithm to decide quantifier-free satisfiability in an initial algebra TΣ{E when the theory pΣ,Eq has the finite variant property and its constructors satisfy a compactness condition. This paper: (i) gives a precise definition of several meta-level sub-algorithms needed for variant satisfiability; (ii) proves them correct; and (iii) presents a reflec...